Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs
نویسندگان
چکیده
منابع مشابه
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs
For given finite (unordered) graphs G and H, we examine the existence of a Ramsey graph F for which the strong Ramsey arrow F −→ (G)r holds. We concentrate on the situation when H is not a complete graph. The set of graphs G for which there exists an F satisfying F −→ (G)2 2 (P2 is a path on 3 vertices) is found to be the union of the set of chordal comparability graphs together with the set of...
متن کاملInduced Graph Ramsey Theory
We say that a graph F strongly arrows (G, H) and write F (G, H) if for every edge-coloring of F with colors red and blue a red G or a blue H occurs as an induced subgraph of F . Induced Ramsey numbers are defined by r(G, H) = min{|V (G)| : F (G, H)}. The value of r(G, H) is finite for all graphs, and good upper bounds on induced Ramsey numbers in general, and for particular families of grap...
متن کاملSizes of Induced Subgraphs of Ramsey Graphs
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of size greater than c log n. Erdős, Faudree and Sós conjectured that every c-Ramsey graph with n vertices contains Ω(n5/2) induced subgraphs any two of which differ either in the number of vertices or in the number of edges, i.e. the number of distinct pairs (|V (H)|, |E(H)|), as H ranges over all i...
متن کاملOn two problems in graph Ramsey theory
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices. The Ramsey number r(H) of a graph H is the least positive integer N such that every twocoloring of the edges of the complete graph KN contains a monochromatic copy of H. A famous resul...
متن کاملRamsey graphs contain many distinct induced subgraphs
It is shown that any graph on n vertices containing no clique and no independent set on t + 1 vertices has at least 2./( 2r2o ~2t)) distinct induced subgraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1993
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1066